Spectral Kernel Methods for Clustering
نویسندگان
چکیده
In this paper we introduce new algorithms for unsupervised learning based on the use of a kernel matrix. All the information required by such algorithms is contained in the eigenvectors of the matrix or of closely related matrices. We use two different but related cost functions, the Alignment and the 'cut cost'. The first one is discussed in a companion paper [3], the second one is based on graph theoretic concepts. Both functions measure the level of clustering of a labeled dataset, or the correlation between data clusters and labels. We state the problem of unsupervised learning as assigning labels so as to optimize these cost functions. We show how the optimal solution can be approximated by slightly relaxing the corresponding optimization problem, and how this corresponds to using eigenvector information. The resulting simple algorithms are tested on real world data with positive results.
منابع مشابه
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with a special interest in two recent approaches: kernel and spectral methods. The aim of this paper is to present a survey of kernel and spectral clustering methods, two approaches able to produce nonlinear separating hype...
متن کاملSpectral methods for image clustering
The clustering problem is to assign labels to points in order to group them in a structurally meaningful way. This is often accomplished by defining cluster centroids in the vector space and assigning points to the cluster with the nearest centroid, as the k-means algorithm does. But this approach does not work for clusters that have unusual shapes, particularly if the clusters are interwoven o...
متن کاملA Unified View of Kernel k-means, Spectral Clustering and Graph Cuts
Recently, a variety of clustering algorithms have been proposed to handle data that is not linearly separable. Spectral clustering and kernel k -means are two such methods that are seemingly quite different. In this paper, we show that a general weighted kernel k -means objective is mathematically equivalent to a weighted graph partitioning objective. Special cases of this graph partitioning ob...
متن کاملAn improved spectral clustering algorithm based on local neighbors in kernel space
Similarity matrix is critical to the performance of spectral clustering. Mercer kernels have become popular largely due to its successes in applying kernel methods such as kernel PCA. A novel spectral clustering method is proposed based on local neighborhood in kernel space (SC-LNK), which assumes that each data point can be linearly reconstructed from its neighbors. The SC-LNK algorithm tries ...
متن کاملLink-based Community Detection with the Commute-Time Kernel
The main purpose of this work is to find communities in a weighted, undirected, graph by using kernel-based clustering methods, directly partitioning the graph according to a well-defined similarity measure between the nodes (a kernel on a graph). The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel (KCT), providing a meaningful similarity measure between any c...
متن کاملText Clustering with String Kernels in R
We present a package which provides a general framework, including tools and algorithms, for text mining in R using the S4 class system. Using this package and the kernlab R package we explore the use of kernel methods for clustering (e.g., kernel k-means and spectral clustering) on a set of text documents, using string kernels. We compare these methods to a more traditional clustering techniqu...
متن کامل